Unavoidable Minors for Graphs with Large $$\ell _p$$-Dimension
نویسندگان
چکیده
A metric graph is a pair (G, d), where G and $$d:E(G) \rightarrow \mathbb {R}_{\ge 0}$$ distance function. Let $$p \in [1,\infty ]$$ be fixed. An isometric embedding of the d) in $$\ell _p^k = (\mathbb {R}^k, d_p)$$ map $$\phi :V(G) {R}^k$$ such that $$d_p(\phi (v), \phi (w)) d(vw)$$ for all edges $$vw\in E(G)$$ . The _p$$ -dimension least integer k there exists an _p^k$$ functions d has _p^K$$ some K. It easy to show minor-monotone property. In this paper, we characterize minor-closed classes $$\mathscr {C}$$ with bounded -dimension, \{2,\infty \}$$ For $$p=2$$ , give simple proof _2$$ if only treewidth. sense, ‘tied’ its $$p=\infty $$ situation completely different. Our main result states class _\infty excludes obtained by joining copies $$K_4$$ using 2-sum operation, or Möbius ladder one ‘horizontal edge’ removed.
منابع مشابه
Unavoidable minors of graphs of large type
In this paper, we study one measure of complexity of a graph, namely its type. The type of a graph G is deened to be the minimum number n such that there is a sequence of graphs G = G 0 , G 1 , : : : , G n , where G i is obtained by contracting one edge in or deleting one edge from each block of G i?1 , and where G n is edgeless. We show that a 3-connected graph has large type if and only if it...
متن کاملUnavoidable parallel minors of 4-connected graphs
A parallel minor is obtained from a graph by any sequence of edge contractions and parallel edge deletions. We prove that, for any positive integer k, every internally 4-connected graph of sufficiently high order contains a parallel minor isomorphic to a variation of K4,k with a complete graph on the vertices of degree k, the k-partition triple fan with a complete graph on the vertices of degre...
متن کاملUnavoidable topological minors of infinite graphs
A graph G is loosely-c-connected, or l-c-connected, if there exists a number d depending on G such that the deletion of fewer than c vertices from G leaves precisely one infinite component and a graph containing at most d vertices. In this paper, we give the structure of a set of l-c-connected infinite graphs that form an unavoidable set among the topological minors of l-c-connected infinite gr...
متن کاملUnavoidable minors of large 4 - connected
11 It is known that any 3-connected matroid that is large enough is certain to contain 12 a minor of a given size belonging one of a few special classes of matroids. This 13 paper proves a similar unavoidable minor result for large 4-connected bicircular 14 matroids. The main result follows from establishing the list of unavoidable minors 15 of large 4-biconnected graphs, which are the graphs r...
متن کاملGraphs with unavoidable subgraphs with large degrees
Let `,(n, m) denote the class of simple graphs on n vertices and m edges and let G C `6(n, m) . There are many results in graph theory giving conditions under which G contains certain types of subgraphs, such as cycles of given lengths, complete graphs, etc . For example, Turan's theorem gives a sufficient condition for G to contain a K,,„ in terms of the number of edges in G . In this paper we...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete and Computational Geometry
سال: 2021
ISSN: ['1432-0444', '0179-5376']
DOI: https://doi.org/10.1007/s00454-021-00285-5